Undirected and directed graphs with near polynomial growth
نویسنده
چکیده
The growth function of a graph with respect to a vertex is near polynomial if there exists a polynomial bounding it above for infinitely many positive integers. In the paper vertex-symmetric undirected graphs and vertex-symmetric directed graphs with coinciding inand out-degrees are described in the case their growth functions are near polynomial.
منابع مشابه
NP Completeness , Part 2
Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...
متن کاملA Group Theoretical Approach to Disjoint Paths in Directed Graphs
This is in general a hard problem The problem is NP complete Knuth cf even if we restrict ourselves to planar undirected graphs Lynch assuming that k is variable On the other hand it is a deep result of Robertson and Seymour that for each xed k the problem can be solved in polynomial time in any undirected graph However for directed graphs the problem remains di cult even for k This was shown b...
متن کاملChinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملStrong Subgraph $k$-connectivity
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations of undirected graphs. In this paper, we introduce a natural extension of generalized k-connectivity of undirected graphs to directed graphs (we call it stro...
متن کاملApproximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 23 شماره
صفحات -
تاریخ انتشار 2003